Efficient distributed detection of conjunctions of local predicates
نویسندگان
چکیده
منابع مشابه
Efficient Distributed Detection of Conjunctions of Local Predicates
Global predicate detection is a fundamental problem in distributed systems and nds applications in many domains such as testing and debugging distributed programs. This paper presents two eecient distributed algorithms to detect conjunctive form global predicates in distributed systems. The algorithms detect the rst consistent global state that satisses the predicate even if the predicate is un...
متن کاملDetecting Conjunctions of Global Predicates
We present an eecient algorithm to detect if the conjunction of two nonlocal predicates is possibly true in a distributed computation. For ooine detection of such global predicates, our algorithm is signiicantly more eecient than the previous algorithms
متن کاملEfficient Detection of Channel Predicates in Distributed Systems
This paper discusses efficient detection of global predicates in a distributed program. Previous work in this area required predicates to be specified as a conjunction of predicates defined on individual processes. Many properties in distributed systems, however, use the state of channels such as “the channel is empty,” or “there is a token in the channel”. In this paper, we introduce the conce...
متن کاملEfficient Detection of Channel Predicates in Distributed Systems1
This paper discusses efficient detection of global predicates in a distributed program. Previous work in this area required predicates to be specified as a conjunction of predicates defined on individual processes. Many properties in distributed systems, however, use the state of channels such as “the channel is empty,” or “there is a token in the channel”. In this paper, we introduce the conce...
متن کاملLocally Distributed Predicates: A Programming Facility for Distributed State Detection
The rise of high-performance computing and internet-scale applications has spurred a renewed interest in distributed computing. Such distributed applications can range from multi-hop routing algorithms used in wireless mesh networks [22] to volunteer-driven parallel data analysis efforts [3,26]. The property of distributed systems that makes them both powerful and challenging is that they are c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Software Engineering
سال: 1998
ISSN: 0098-5589
DOI: 10.1109/32.707701